Searching for Gapped Palindromes
نویسندگان
چکیده
Westudy the problemof finding, in a givenword, allmaximal gappedpalindromes verifying two types of constraints, that we call long-armed and length-constrained palindromes. For each of the two classes, we propose an algorithm that runs in time O(n+ S) for a constantsize alphabet, where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes within the same time bound. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Improved Upper Bounds on all Maximal $\alpha$-gapped Repeats and Palindromes
We show that the number of all maximal α-gapped repeats and palindromes of a word of length n is at most 3(π/6 + 5/2)αn and 7(π/6 + 1/2)αn − 5n− 1, respectively.
متن کاملGapped Pattern Statistics
We give a probabilistic analysis of parameters related to α-gapped repeats and palindromes in random words, under both uniform and memoryless distributions (where letters have different probabilities, but are drawn independently). More precisely, we study the expected number of maximal α-gapped patterns, as well as the expected length of the longest α-gapped pattern in a random word. 1998 ACM S...
متن کاملLongest Gapped Repeats and Palindromes
A gapped repeat (respectively, palindrome) occurring in a word w is a factor uvu (respectively, uvu) of w. In such a repeat (palindrome) u is called the arm of the repeat (respectively, palindrome), while v is called the gap. We show how to compute efficiently, for every position i of the word w, the longest gapped repeat and palindrome occurring at that position, provided that the length of th...
متن کاملComputing Longest Single-arm-gapped Palindromes in a String
In this paper, we introduce new types of approximate palindromes called singlearm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either wgucuw or wucugw, where w and u are non-empty strings, w and u are respectively the reversed strings of w and u, g is a gap, and c is either a single character or the empty string. We classify ...
متن کاملEfficiently Finding All Maximal alpha-gapped Repeats
For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two factors u in such a repeat are called arms, while the factor v is called gap. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right or, respectively, to the left. In this paper we show that the number of maximal α-gapped repeats that may occur i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2008